Theorem qtopcn 24088

Description: Universal property of a quotient map. (Contributed by Mario Carneiro, 23-Mar-2015.)

Assertion

Ref	Expression
qtopcn	⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → (𝐺 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ↔ (𝐺 ∘ 𝐹) ∈ (𝐽 Cn 𝐾)))

Proof of Theorem qtopcn

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnvimass 6217	. . . . . . 7 ⊢ (◡𝐺 “ 𝑥) ⊆ dom 𝐺
2		simplrr 790	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) ∧ 𝑥 ∈ 𝐾) → 𝐺:𝑌⟶𝑍)
3	1, 2	fssdm 6759	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) ∧ 𝑥 ∈ 𝐾) → (◡𝐺 “ 𝑥) ⊆ 𝑌)
4		simplll 787	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) ∧ 𝑥 ∈ 𝐾) → 𝐽 ∈ (TopOn‘𝑋))
5		simplrl 789	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) ∧ 𝑥 ∈ 𝐾) → 𝐹:𝑋⟶onto𝑌)
6		elqtop3 24077	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋⟶onto𝑌) → ((◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹) ↔ ((◡𝐺 “ 𝑥) ⊆ 𝑌 ∧ (◡𝐹 “ (◡𝐺 “ 𝑥)) ∈ 𝐽)))
7	4, 5, 6	syl2anc 596	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) ∧ 𝑥 ∈ 𝐾) → ((◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹) ↔ ((◡𝐺 “ 𝑥) ⊆ 𝑌 ∧ (◡𝐹 “ (◡𝐺 “ 𝑥)) ∈ 𝐽)))
8	3, 7	mpbirand 720	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) ∧ 𝑥 ∈ 𝐾) → ((◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹) ↔ (◡𝐹 “ (◡𝐺 “ 𝑥)) ∈ 𝐽))
9		cnvco 5879	. . . . . . . 8 ⊢ ◡(𝐺 ∘ 𝐹) = (◡𝐹 ∘ ◡𝐺)
10	9	imaeq1i 6067	. . . . . . 7 ⊢ (◡(𝐺 ∘ 𝐹) “ 𝑥) = ((◡𝐹 ∘ ◡𝐺) “ 𝑥)
11		imaco 6271	. . . . . . 7 ⊢ ((◡𝐹 ∘ ◡𝐺) “ 𝑥) = (◡𝐹 “ (◡𝐺 “ 𝑥))
12	10, 11	eqtri 2786	. . . . . 6 ⊢ (◡(𝐺 ∘ 𝐹) “ 𝑥) = (◡𝐹 “ (◡𝐺 “ 𝑥))
13	12	eleq1i 2855	. . . . 5 ⊢ ((◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽 ↔ (◡𝐹 “ (◡𝐺 “ 𝑥)) ∈ 𝐽)
14	8, 13	bitr4di 292	. . . 4 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) ∧ 𝑥 ∈ 𝐾) → ((◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹) ↔ (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽))
15	14	ralbidva 3187	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → (∀𝑥 ∈ 𝐾 (◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹) ↔ ∀𝑥 ∈ 𝐾 (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽))
16		simprr 785	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → 𝐺:𝑌⟶𝑍)
17	16	biantrurd 542	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → (∀𝑥 ∈ 𝐾 (◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹) ↔ (𝐺:𝑌⟶𝑍 ∧ ∀𝑥 ∈ 𝐾 (◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹))))
18		fof 6826	. . . . . 6 ⊢ (𝐹:𝑋⟶onto𝑌 → 𝐹:𝑋⟶𝑌)
19	18	ad2antrl 741	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → 𝐹:𝑋⟶𝑌)
20		fco 6764	. . . . 5 ⊢ ((𝐺:𝑌⟶𝑍 ∧ 𝐹:𝑋⟶𝑌) → (𝐺 ∘ 𝐹):𝑋⟶𝑍)
21	16, 19, 20	syl2anc 596	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → (𝐺 ∘ 𝐹):𝑋⟶𝑍)
22	21	biantrurd 542	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → (∀𝑥 ∈ 𝐾 (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽 ↔ ((𝐺 ∘ 𝐹):𝑋⟶𝑍 ∧ ∀𝑥 ∈ 𝐾 (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽)))
23	15, 17, 22	3bitr3d 312	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → ((𝐺:𝑌⟶𝑍 ∧ ∀𝑥 ∈ 𝐾 (◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹)) ↔ ((𝐺 ∘ 𝐹):𝑋⟶𝑍 ∧ ∀𝑥 ∈ 𝐾 (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽)))
24		qtoptopon 24078	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋⟶onto𝑌) → (𝐽 qTop 𝐹) ∈ (TopOn‘𝑌))
25	24	ad2ant2r 760	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → (𝐽 qTop 𝐹) ∈ (TopOn‘𝑌))
26		simplr 781	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → 𝐾 ∈ (TopOn‘𝑍))
27		iscn 23608	. . 3 ⊢ (((𝐽 qTop 𝐹) ∈ (TopOn‘𝑌) ∧ 𝐾 ∈ (TopOn‘𝑍)) → (𝐺 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ↔ (𝐺:𝑌⟶𝑍 ∧ ∀𝑥 ∈ 𝐾 (◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹))))
28	25, 26, 27	syl2anc 596	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → (𝐺 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ↔ (𝐺:𝑌⟶𝑍 ∧ ∀𝑥 ∈ 𝐾 (◡𝐺 “ 𝑥) ∈ (𝐽 qTop 𝐹))))
29		iscn 23608	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) → ((𝐺 ∘ 𝐹) ∈ (𝐽 Cn 𝐾) ↔ ((𝐺 ∘ 𝐹):𝑋⟶𝑍 ∧ ∀𝑥 ∈ 𝐾 (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽)))
30	29	adantr 486	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → ((𝐺 ∘ 𝐹) ∈ (𝐽 Cn 𝐾) ↔ ((𝐺 ∘ 𝐹):𝑋⟶𝑍 ∧ ∀𝑥 ∈ 𝐾 (◡(𝐺 ∘ 𝐹) “ 𝑥) ∈ 𝐽)))
31	23, 28, 30	3bitr4d 314	1 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑍)) ∧ (𝐹:𝑋⟶onto𝑌 ∧ 𝐺:𝑌⟶𝑍)) → (𝐺 ∈ ((𝐽 qTop 𝐹) Cn 𝐾) ↔ (𝐺 ∘ 𝐹) ∈ (𝐽 Cn 𝐾)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  ^◡ccnv 5657   “ cima 5661   ∘ ccom 5662  ⟶wf 6562  ⟶ontowfo 6564  ‘cfv 6566  (class class class)co 7451   qTop cqtop 17725  TopOnctopon 23283   Cn ccn 23597

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-qtop 17729  df-top 23267  df-topon 23284  df-cn 23600

This theorem is used by:  qtopeu  24090