Theorem reuf1odnf 47467

Description: There is exactly one element in each of two isomorphic sets. Variant of reuf1od 47468 with no distinct variable condition for 𝜒. (Contributed by AV, 19-Mar-2023.)

Hypotheses

Ref	Expression
reuf1odnf.f	⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐵)
reuf1odnf.x	⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ 𝜒))
reuf1odnf.z	⊢ (𝑥 = 𝑧 → (𝜓 ↔ 𝜃))
reuf1odnf.n	⊢ Ⅎ𝑥𝜒

Assertion

Ref	Expression
reuf1odnf	⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))

Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐹,𝑦   𝜑,𝑥,𝑦   𝜓,𝑦   𝜓,𝑧   𝜃,𝑥   𝑥,𝑧

Allowed substitution hints:   𝜑(𝑧)   𝜓(𝑥)   𝜒(𝑥,𝑦,𝑧)   𝜃(𝑦,𝑧)   𝐵(𝑧)   𝐶(𝑧)   𝐹(𝑧)

Proof of Theorem reuf1odnf

Step	Hyp	Ref	Expression
1		reuf1odnf.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐵)
2		f1of 6782	. . . . 5 ⊢ (𝐹:𝐶–1-1-onto→𝐵 → 𝐹:𝐶⟶𝐵)
3	1, 2	syl 17	. . . 4 ⊢ (𝜑 → 𝐹:𝐶⟶𝐵)
4	3	ffvelcdmda 7038	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → (𝐹‘𝑦) ∈ 𝐵)
5		f1ofveu 7362	. . . . 5 ⊢ ((𝐹:𝐶–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 (𝐹‘𝑦) = 𝑥)
6		eqcom 2744	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑦) ↔ (𝐹‘𝑦) = 𝑥)
7	6	reubii 3361	. . . . 5 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = (𝐹‘𝑦) ↔ ∃!𝑦 ∈ 𝐶 (𝐹‘𝑦) = 𝑥)
8	5, 7	sylibr 234	. . . 4 ⊢ ((𝐹:𝐶–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = (𝐹‘𝑦))
9	1, 8	sylan 581	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = (𝐹‘𝑦))
10		sbceq1a 3753	. . . . 5 ⊢ (𝑥 = (𝐹‘𝑦) → (𝜓 ↔ [(𝐹‘𝑦) / 𝑥]𝜓))
11	10	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ [(𝐹‘𝑦) / 𝑥]𝜓))
12		reuf1odnf.z	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝜓 ↔ 𝜃))
13	12	cbvsbcvw 3776	. . . 4 ⊢ ([(𝐹‘𝑦) / 𝑥]𝜓 ↔ [(𝐹‘𝑦) / 𝑧]𝜃)
14	11, 13	bitrdi 287	. . 3 ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ [(𝐹‘𝑦) / 𝑧]𝜃))
15	4, 9, 14	reuxfr1d 3710	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑧]𝜃))
16	13	a1i 11	. . . 4 ⊢ (𝜑 → ([(𝐹‘𝑦) / 𝑥]𝜓 ↔ [(𝐹‘𝑦) / 𝑧]𝜃))
17	16	bicomd 223	. . 3 ⊢ (𝜑 → ([(𝐹‘𝑦) / 𝑧]𝜃 ↔ [(𝐹‘𝑦) / 𝑥]𝜓))
18	17	reubidv 3368	. 2 ⊢ (𝜑 → (∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑧]𝜃 ↔ ∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑥]𝜓))
19		fvexd 6857	. . . 4 ⊢ (𝜑 → (𝐹‘𝑦) ∈ V)
20		reuf1odnf.x	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ 𝜒))
21		nfv 1916	. . . 4 ⊢ Ⅎ𝑥𝜑
22		reuf1odnf.n	. . . . 5 ⊢ Ⅎ𝑥𝜒
23	22	a1i 11	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝜒)
24	19, 20, 21, 23	sbciedf 3785	. . 3 ⊢ (𝜑 → ([(𝐹‘𝑦) / 𝑥]𝜓 ↔ 𝜒))
25	24	reubidv 3368	. 2 ⊢ (𝜑 → (∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑥]𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))
26	15, 18, 25	3bitrd 305	1 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  Ⅎwnf 1785   ∈ wcel 2114  ∃!wreu 3350  Vcvv 3442  [wsbc 3742  ⟶wf 6496  –1-1-onto→wf1o 6499  ‘cfv 6500

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508

This theorem is referenced by:  prproropreud  47869