Theorem dfcnv2 33029

Description: Alternative definition of the converse of a relation. (Contributed by Thierry Arnoux, 31-Mar-2018.)

Assertion

Ref	Expression
dfcnv2	⊢ (ran 𝑅 ⊆ 𝐴 → ◡𝑅 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})))

Distinct variable groups:   𝑥,𝐴   𝑥,𝑅

Proof of Theorem dfcnv2

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relcnv 6106	. 2 ⊢ Rel ◡𝑅
2		relxp 5679	. . . 4 ⊢ Rel ({𝑥} × (◡𝑅 “ {𝑥}))
3	2	rgenw 3083	. . 3 ⊢ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥}))
4		reliun 5803	. . 3 ⊢ (Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥})))
5	3, 4	mpbir 234	. 2 ⊢ Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥}))
6		vex 3459	. . . . . . . . 9 ⊢ 𝑧 ∈ V
7		vex 3459	. . . . . . . . 9 ⊢ 𝑦 ∈ V
8	6, 7	opeldm 5897	. . . . . . . 8 ⊢ (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 → 𝑧 ∈ dom ◡𝑅)
9		df-rn 5672	. . . . . . . 8 ⊢ ran 𝑅 = dom ◡𝑅
10	8, 9	eleqtrrdi 2874	. . . . . . 7 ⊢ (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 → 𝑧 ∈ ran 𝑅)
11		ssel2 3932	. . . . . . 7 ⊢ ((ran 𝑅 ⊆ 𝐴 ∧ 𝑧 ∈ ran 𝑅) → 𝑧 ∈ 𝐴)
12	10, 11	sylan2 604	. . . . . 6 ⊢ ((ran 𝑅 ⊆ 𝐴 ∧ ⟨𝑧, 𝑦⟩ ∈ ◡𝑅) → 𝑧 ∈ 𝐴)
13	12	ex 417	. . . . 5 ⊢ (ran 𝑅 ⊆ 𝐴 → (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 → 𝑧 ∈ 𝐴))
14	13	pm4.71rd 571	. . . 4 ⊢ (ran 𝑅 ⊆ 𝐴 → (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ ⟨𝑧, 𝑦⟩ ∈ ◡𝑅)))
15	6, 7	elimasn 6092	. . . . 5 ⊢ (𝑦 ∈ (◡𝑅 “ {𝑧}) ↔ ⟨𝑧, 𝑦⟩ ∈ ◡𝑅)
16	15	anbi2i 634	. . . 4 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})) ↔ (𝑧 ∈ 𝐴 ∧ ⟨𝑧, 𝑦⟩ ∈ ◡𝑅))
17	14, 16	bitr4di 292	. . 3 ⊢ (ran 𝑅 ⊆ 𝐴 → (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧}))))
18		sneq 4599	. . . . 5 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧})
19	18	imaeq2d 6062	. . . 4 ⊢ (𝑥 = 𝑧 → (◡𝑅 “ {𝑥}) = (◡𝑅 “ {𝑧}))
20	19	opeliunxp2 5824	. . 3 ⊢ (⟨𝑧, 𝑦⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})))
21	17, 20	bitr4di 292	. 2 ⊢ (ran 𝑅 ⊆ 𝐴 → (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 ↔ ⟨𝑧, 𝑦⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥}))))
22	1, 5, 21	eqrelrdv 5778	1 ⊢ (ran 𝑅 ⊆ 𝐴 → ◡𝑅 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079   ⊆ wss 3905  {csn 4589  ⟨cop 4595  ∪ ciun 4956   × cxp 5659  ^◡ccnv 5660  dom cdm 5661  ran crn 5662   “ cima 5664  Rel wrel 5666

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-iun 4958  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-cnv 5669  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674

This theorem is used by:  gsummpt2co  33377