cnvimadfsn - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > cnvimadfsn		GIF version

Theorem cnvimadfsn 6423

Description: The support of functions "defined" by inverse images expressed by binary relations. (Contributed by AV, 7-Apr-2019.)

**Assertion**
Ref	Expression
cnvimadfsn	⊢ (^◡𝑅 “ (V ∖ {𝑍})) = {𝑥 ∣ ∃𝑦(𝑥𝑅𝑦 ∧ 𝑦 ≠ 𝑍)}

Distinct variable groups: 𝑥,𝑅,𝑦 𝑥,𝑍,𝑦

**Proof of Theorem cnvimadfsn**
Step	Hyp	Ref	Expression
1		dfima3 5085	. 2 ⊢ (^◡𝑅 “ (V ∖ {𝑍})) = {𝑥 ∣ ∃𝑦(𝑦 ∈ (V ∖ {𝑍}) ∧ ⟨𝑦, 𝑥⟩ ∈ ^◡𝑅)}
2		eldifvsn 3810	. . . . . 6 ⊢ (𝑦 ∈ V → (𝑦 ∈ (V ∖ {𝑍}) ↔ 𝑦 ≠ 𝑍))
3	2	elv 2807	. . . . 5 ⊢ (𝑦 ∈ (V ∖ {𝑍}) ↔ 𝑦 ≠ 𝑍)
4		vex 2806	. . . . . . 7 ⊢ 𝑦 ∈ V
5		vex 2806	. . . . . . 7 ⊢ 𝑥 ∈ V
6	4, 5	opelcnv 4918	. . . . . 6 ⊢ (⟨𝑦, 𝑥⟩ ∈ ^◡𝑅 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
7		df-br 4094	. . . . . 6 ⊢ (𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
8	6, 7	bitr4i 187	. . . . 5 ⊢ (⟨𝑦, 𝑥⟩ ∈ ^◡𝑅 ↔ 𝑥𝑅𝑦)
9	3, 8	anbi12ci 461	. . . 4 ⊢ ((𝑦 ∈ (V ∖ {𝑍}) ∧ ⟨𝑦, 𝑥⟩ ∈ ^◡𝑅) ↔ (𝑥𝑅𝑦 ∧ 𝑦 ≠ 𝑍))
10	9	exbii 1654	. . 3 ⊢ (∃𝑦(𝑦 ∈ (V ∖ {𝑍}) ∧ ⟨𝑦, 𝑥⟩ ∈ ^◡𝑅) ↔ ∃𝑦(𝑥𝑅𝑦 ∧ 𝑦 ≠ 𝑍))
11	10	abbii 2347	. 2 ⊢ {𝑥 ∣ ∃𝑦(𝑦 ∈ (V ∖ {𝑍}) ∧ ⟨𝑦, 𝑥⟩ ∈ ^◡𝑅)} = {𝑥 ∣ ∃𝑦(𝑥𝑅𝑦 ∧ 𝑦 ≠ 𝑍)}
12	1, 11	eqtri 2252	1 ⊢ (^◡𝑅 “ (V ∖ {𝑍})) = {𝑥 ∣ ∃𝑦(𝑥𝑅𝑦 ∧ 𝑦 ≠ 𝑍)}

Colors of variables: wff set class

Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1398 ∃wex 1541 ∈ wcel 2202 {cab 2217 ≠ wne 2403 Vcvv 2803 ∖ cdif 3198 {csn 3673 ⟨cop 3676 class class class wbr 4093 ^◡ccnv 4730 “ cima 4734

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305

This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-v 2805 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-br 4094 df-opab 4156 df-xp 4737 df-cnv 4739 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744

This theorem is referenced by: (None)

W3C validator