FHIR CI-Build
TerminologyThis is the Continuous Integration Build of FHIR (will be incorrect/inconsistent at times).
See the Directory of published versions
| Terminology Infrastructure Work Group | Maturity Level: N/A | Standards Status: Informative |
Raw Turtle (+ also see Turtle/RDF Format Specification)
Definition for Code SystemFilterOperator
@prefix fhir: <http://hl7.org/fhir/> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
# - resource -------------------------------------------------------------------
<http://hl7.org/fhir/CodeSystem/filter-operator> a fhir:CodeSystem ;
fhir:nodeRole fhir:treeRoot ;
fhir:id [ fhir:v "filter-operator"] ; #
fhir:meta [
fhir:lastUpdated [ fhir:v "2025-10-30T03:40:51.999+11:00"^^xsd:dateTime ] ;
fhir:profile ( [
fhir:v "http://hl7.org/fhir/StructureDefinition/shareablecodesystem"^^xsd:anyURI ;
fhir:link <http://hl7.org/fhir/StructureDefinition/shareablecodesystem>
] )
] ; #
fhir:text [
fhir:status [ fhir:v "extensions" ] ;
fhir:div "<div xmlns=\"http://www.w3.org/1999/xhtml\">\n \n \n \n <p>This code system http://hl7.org/fhir/filter-operator defines the following codes:</p>\n \n \n \n <table class=\"codes\">\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">\n \n \n \n <b>Code</b>\n \n \n \n </td>\n \n \n \n <td>\n \n \n \n <b>Display</b>\n \n \n \n </td>\n \n \n \n <td>\n \n \n \n <b>Definition</b>\n \n \n \n </td>\n \n \n \n <td>\n \n \n \n <b>Comments</b>\n \n \n \n </td>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">=\n \n \n \n <a name=\"filter-operator-.61\"> </a>\n \n \n \n </td>\n \n \n \n <td>Equals</td>\n \n \n \n <td>The specified property of the code equals the provided value.</td>\n \n \n \n <td/>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">is-a\n \n \n \n <a name=\"filter-operator-is-a\"> </a>\n \n \n \n </td>\n \n \n \n <td>Is A (by subsumption)</td>\n \n \n \n <td>Includes all concept ids that have a transitive is-a relationship with the concept Id provided as the value, including the provided concept itself (include descendant codes and self).</td>\n \n \n \n <td>The definition of is-a is that all the properties of the value are true for the specified property of the code, which means that a code has an is-a relationship with itself. To exclude the root code, use descendent-of</td>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">descendent-of\n \n \n \n <a name=\"filter-operator-descendent-of\"> </a>\n \n \n \n </td>\n \n \n \n <td>Descendent Of (by subsumption)</td>\n \n \n \n <td>Includes all concept ids that have a transitive is-a relationship with the concept Id provided as the value, excluding the provided concept itself i.e. include descendant codes only).</td>\n \n \n \n <td>The definition of is-a is that all the properties of the value are true for the specified property of the code. \n\nSpelling note: \"descendant\" is a more correct spelling, but the spelling \"descendent\" is maintained in the code for backwards compatibility reasons</td>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">is-not-a\n \n \n \n <a name=\"filter-operator-is-not-a\"> </a>\n \n \n \n </td>\n \n \n \n <td>Not (Is A) (by subsumption)</td>\n \n \n \n <td>The specified property of the code does not have an is-a relationship with the provided value.</td>\n \n \n \n <td/>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">regex\n \n \n \n <a name=\"filter-operator-regex\"> </a>\n \n \n \n </td>\n \n \n \n <td>Regular Expression</td>\n \n \n \n <td>The specified property of the code matches the regex specified in the provided value.</td>\n \n \n \n <td/>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">in\n \n \n \n <a name=\"filter-operator-in\"> </a>\n \n \n \n </td>\n \n \n \n <td>In Set</td>\n \n \n \n <td>The specified property of the code is in the set of codes or concepts specified in the provided value (comma-separated list).</td>\n \n \n \n <td/>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">not-in\n \n \n \n <a name=\"filter-operator-not-in\"> </a>\n \n \n \n </td>\n \n \n \n <td>Not in Set</td>\n \n \n \n <td>The specified property of the code is not in the set of codes or concepts specified in the provided value (comma-separated list).</td>\n \n \n \n <td/>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">generalizes\n \n \n \n <a name=\"filter-operator-generalizes\"> </a>\n \n \n \n </td>\n \n \n \n <td>Generalizes (by Subsumption)</td>\n \n \n \n <td>Includes all concept ids that have a transitive is-a relationship from the concept Id provided as the value, including the provided concept itself (i.e. include ancestor codes and self).</td>\n \n \n \n <td>The definition of is-a is that all the properties of the value are true for the specified property of the code, which means that a code has an is-a relationship with itself. To exclude the root code, add it explicitly to as an exclude</td>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">exists\n \n \n \n <a name=\"filter-operator-exists\"> </a>\n \n \n \n </td>\n \n \n \n <td>Exists</td>\n \n \n \n <td>The specified property of the code has at least one value (if the specified value is true; if the specified value is false, then matches when the specified property of the code has no values).</td>\n \n \n \n <td/>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">child-of\n \n \n \n <a name=\"filter-operator-child-of\"> </a>\n \n \n \n </td>\n \n \n \n <td>Child Of</td>\n \n \n \n <td>Only concepts with a direct hierarchical relationship to the index code and no other concepts. This does not include the index code in the output.</td>\n \n \n \n <td/>\n \n \n \n </tr>\n \n \n \n <tr>\n \n \n \n <td style=\"white-space:nowrap\">descendent-leaf\n \n \n \n <a name=\"filter-operator-descendent-leaf\"> </a>\n \n \n \n </td>\n \n \n \n <td>Descendent Leaf</td>\n \n \n \n <td>Includes concept ids that have a transitive is-a relationship with the concept Id provided as the value, but which do not have any concept ids with transitive is-a relationships with themselves.</td>\n \n \n \n <td/>\n \n \n \n </tr>\n \n \n \n </table>\n \n \n \n </div>"^^rdf:XMLLiteral
] ; #
fhir:extension ( [
fhir:url [ fhir:v "http://hl7.org/fhir/StructureDefinition/structuredefinition-wg"^^xsd:anyURI ] ;
fhir:value [
a fhir:code ;
fhir:v "vocab"
]
] [
fhir:url [ fhir:v "http://hl7.org/fhir/StructureDefinition/structuredefinition-standards-status"^^xsd:anyURI ] ;
fhir:value [
a fhir:code ;
fhir:v "normative"
]
] [
fhir:url [ fhir:v "http://hl7.org/fhir/StructureDefinition/structuredefinition-normative-version"^^xsd:anyURI ] ;
fhir:value [
a fhir:code ;
fhir:v "4.0.0"
]
] [
fhir:url [ fhir:v "http://hl7.org/fhir/StructureDefinition/structuredefinition-fmm"^^xsd:anyURI ] ;
fhir:value [
a fhir:integer ;
fhir:v 5
]
] ) ; #
fhir:url [ fhir:v "http://hl7.org/fhir/filter-operator"^^xsd:anyURI] ; #
fhir:identifier ( [
fhir:system [ fhir:v "urn:ietf:rfc:3986"^^xsd:anyURI ] ;
fhir:value [ fhir:v "urn:oid:2.16.840.1.113883.4.642.4.479" ]
] [
fhir:use [ fhir:v "old" ] ;
fhir:system [ fhir:v "urn:ietf:rfc:3986"^^xsd:anyURI ] ;
fhir:value [ fhir:v "urn:oid:2.16.840.1.113883.4.642.1.472" ]
] [
fhir:use [ fhir:v "old" ] ;
fhir:system [ fhir:v "urn:ietf:rfc:3986"^^xsd:anyURI ] ;
fhir:value [ fhir:v "urn:oid:2.16.840.1.113883.4.642.2.280" ]
] ) ; #
fhir:version [ fhir:v "6.0.0-ballot3"] ; #
fhir:name [ fhir:v "FilterOperator"] ; #
fhir:title [ fhir:v "Filter Operator"] ; #
fhir:status [ fhir:v "active"] ; #
fhir:experimental [ fhir:v false] ; #
fhir:date [ fhir:v "2021-01-05T10:01:24+11:00"^^xsd:dateTime] ; #
fhir:publisher [ fhir:v "HL7 (FHIR Project)"] ; #
fhir:contact ( [
fhir:telecom ( [
fhir:system [ fhir:v "url" ] ;
fhir:value [ fhir:v "http://hl7.org/fhir" ]
] [
fhir:system [ fhir:v "email" ] ;
fhir:value [ fhir:v "fhir@lists.hl7.org" ]
] )
] ) ; #
fhir:description [ fhir:v "The kind of operation to perform as a part of a property based filter."] ; #
fhir:jurisdiction ( [
fhir:coding ( [
fhir:system [ fhir:v "http://unstats.un.org/unsd/methods/m49/m49.htm"^^xsd:anyURI ] ;
fhir:code [ fhir:v "001" ] ;
fhir:display [ fhir:v "World" ]
] )
] ) ; #
fhir:caseSensitive [ fhir:v true] ; #
fhir:valueSet [
fhir:v "http://hl7.org/fhir/ValueSet/filter-operator"^^xsd:anyURI ;
fhir:link <http://hl7.org/fhir/ValueSet/filter-operator>
] ; #
fhir:hierarchyMeaning [] ; #
fhir:content [ fhir:v "complete"] ; #
fhir:concept ( [
fhir:code [ fhir:v "=" ] ;
fhir:display [ fhir:v "Equals" ] ;
fhir:definition [ fhir:v "The specified property of the code equals the provided value." ]
] [
fhir:code [ fhir:v "is-a" ] ;
fhir:display [ fhir:v "Is A (by subsumption)" ] ;
fhir:definition [ fhir:v "Includes all concept ids that have a transitive is-a relationship with the concept Id provided as the value, including the provided concept itself (include descendant codes and self)." ] ;
fhir:property ( [
fhir:code [ fhir:v "comments" ] ;
fhir:value [
a fhir:string ;
fhir:v "The definition of is-a is that all the properties of the value are true for the specified property of the code, which means that a code has an is-a relationship with itself. To exclude the root code, use descendent-of"
]
] )
] [
fhir:code [ fhir:v "descendent-of" ] ;
fhir:display [ fhir:v "Descendent Of (by subsumption)" ] ;
fhir:definition [ fhir:v "Includes all concept ids that have a transitive is-a relationship with the concept Id provided as the value, excluding the provided concept itself (i.e. include descendant codes only)." ] ;
fhir:property ( [
fhir:code [ fhir:v "comments" ] ;
fhir:value [
a fhir:string ;
fhir:v "The definition of is-a is that all the properties of the value are true for the specified property of the code. \n\nSpelling note: \"descendant\" is a more correct spelling, but the spelling \"descendent\" is maintained in the code for backwards compatibility reasons"
]
] )
] [
fhir:code [ fhir:v "is-not-a" ] ;
fhir:display [ fhir:v "Not (Is A) (by subsumption)" ] ;
fhir:definition [ fhir:v "The specified property of the code does not have an is-a relationship with the provided value." ]
] [
fhir:code [ fhir:v "regex" ] ;
fhir:display [ fhir:v "Regular Expression" ] ;
fhir:definition [ fhir:v "The specified property of the code matches the regex specified in the provided value." ]
] [
fhir:code [ fhir:v "in" ] ;
fhir:display [ fhir:v "In Set" ] ;
fhir:definition [ fhir:v "The specified property of the code is in the set of codes or concepts specified in the provided value (comma-separated list)." ]
] [
fhir:code [ fhir:v "not-in" ] ;
fhir:display [ fhir:v "Not in Set" ] ;
fhir:definition [ fhir:v "The specified property of the code is not in the set of codes or concepts specified in the provided value (comma-separated list)." ]
] [
fhir:code [ fhir:v "generalizes" ] ;
fhir:display [ fhir:v "Generalizes (by Subsumption)" ] ;
fhir:definition [ fhir:v "Includes all concept ids that have a transitive is-a relationship from the concept Id provided as the value, including the provided concept itself (i.e. include ancestor codes and self)." ] ;
fhir:property ( [
fhir:code [ fhir:v "comments" ] ;
fhir:value [
a fhir:string ;
fhir:v "The definition of is-a is that all the properties of the value are true for the specified property of the code, which means that a code has an is-a relationship with itself. To exclude the root code, add it explicitly to as an exclude"
]
] )
] [
fhir:code [ fhir:v "child-of" ] ;
fhir:display [ fhir:v "Child Of" ] ;
fhir:definition [ fhir:v "Only concepts with a direct hierarchical relationship to the index code and no other concepts. This does not include the index code in the output." ]
] [
fhir:code [ fhir:v "descendent-leaf" ] ;
fhir:display [ fhir:v "Descendent Leaf" ] ;
fhir:definition [ fhir:v "Includes concept ids that have a transitive is-a relationship with the concept Id provided as the value, but which do not have any concept ids with transitive is-a relationships with themselves." ]
] [
fhir:code [ fhir:v "exists" ] ;
fhir:display [ fhir:v "Exists" ] ;
fhir:definition [ fhir:v "The specified property of the code has at least one value (if the specified value is true; if the specified value is false, then matches when the specified property of the code has no values)." ]
] ) . #
# -------------------------------------------------------------------------------------
Usage note: every effort has been made to ensure that the examples are correct and useful, but they are not a normative part of the specification.
FHIR ®© HL7.org 2011+. FHIR R6 hl7.fhir.core#6.0.0-ballot3 generated on Wed, Oct 29, 2025 16:42+0000.
Links: Search |
Version History |
Contents |
Glossary |
QA |
Compare to R5 |
|
Propose a change